<title>机器分配</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span> <span class="pl-cpf">&lt;algorithm&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span> <span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span> <span class="pl-cpf">&lt;cstring&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span> <span class="pl-cpf">&lt;iostream&gt;</span><span class="pl-cp"></span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>

<span class="pl-k">const</span> <span class="pl-kt">int</span> <span class="pl-n">maxm</span> <span class="pl-o">=</span> <span class="pl-mi">16</span><span class="pl-p">;</span>
<span class="pl-k">const</span> <span class="pl-kt">int</span> <span class="pl-n">maxn</span> <span class="pl-o">=</span> <span class="pl-mi">11</span><span class="pl-p">;</span>

<span class="pl-kt">int</span> <span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">maxn</span><span class="pl-p">][</span><span class="pl-n">maxm</span><span class="pl-p">],</span> <span class="pl-n">result</span><span class="pl-p">[</span><span class="pl-n">maxn</span><span class="pl-p">][</span><span class="pl-n">maxm</span><span class="pl-p">],</span> <span class="pl-n">n</span><span class="pl-p">,</span> <span class="pl-n">m</span><span class="pl-p">,</span> <span class="pl-n">profit</span><span class="pl-p">[</span><span class="pl-n">maxn</span><span class="pl-p">][</span><span class="pl-n">maxm</span><span class="pl-p">];</span>
<span class="pl-kt">void</span> <span class="pl-nf">output</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">x</span><span class="pl-p">,</span> <span class="pl-kt">int</span> <span class="pl-n">y</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">x</span> <span class="pl-o">==</span> <span class="pl-mi">0</span><span class="pl-p">)</span> <span class="pl-k">return</span><span class="pl-p">;</span>
    <span class="pl-n">output</span><span class="pl-p">(</span><span class="pl-n">x</span> <span class="pl-o">-</span> <span class="pl-mi">1</span><span class="pl-p">,</span> <span class="pl-n">y</span> <span class="pl-o">-</span> <span class="pl-n">result</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">][</span><span class="pl-n">y</span><span class="pl-p">]);</span>
    <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d %d</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span> <span class="pl-n">x</span><span class="pl-p">,</span> <span class="pl-n">result</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">][</span><span class="pl-n">y</span><span class="pl-p">]);</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">()</span> <span class="pl-p">{</span>
    <span class="pl-k">while</span> <span class="pl-p">(</span><span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d %d&quot;</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">m</span><span class="pl-p">)</span> <span class="pl-o">!=</span> <span class="pl-n">EOF</span><span class="pl-p">)</span> <span class="pl-p">{</span>
        <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">dp</span><span class="pl-p">,</span> <span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">dp</span><span class="pl-p">));</span>
        <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">profit</span><span class="pl-p">,</span> <span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">profit</span><span class="pl-p">));</span>
        <span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">result</span><span class="pl-p">,</span> <span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">result</span><span class="pl-p">));</span>
        <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-p">{</span>
            <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">j</span> <span class="pl-o">&lt;=</span> <span class="pl-n">m</span><span class="pl-p">;</span> <span class="pl-n">j</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">profit</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-p">]);</span>
        <span class="pl-p">}</span>
        <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-p">{</span>
            <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">j</span> <span class="pl-o">&lt;=</span> <span class="pl-n">m</span><span class="pl-p">;</span> <span class="pl-n">j</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-p">{</span>
                <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">k</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span> <span class="pl-n">k</span> <span class="pl-o">&lt;=</span> <span class="pl-n">j</span><span class="pl-p">;</span> <span class="pl-n">k</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-p">{</span>
                    <span class="pl-kt">int</span> <span class="pl-n">val</span> <span class="pl-o">=</span> <span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">i</span> <span class="pl-o">-</span> <span class="pl-mi">1</span><span class="pl-p">][</span><span class="pl-n">j</span> <span class="pl-o">-</span> <span class="pl-n">k</span><span class="pl-p">]</span> <span class="pl-o">+</span> <span class="pl-n">profit</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-n">k</span><span class="pl-p">];</span>
                    <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-p">]</span> <span class="pl-o">&lt;=</span> <span class="pl-n">val</span><span class="pl-p">)</span> <span class="pl-p">{</span>
                        <span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">val</span><span class="pl-p">;</span>
                        <span class="pl-n">result</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">k</span><span class="pl-p">;</span>
                    <span class="pl-p">}</span>
                <span class="pl-p">}</span>
            <span class="pl-p">}</span>
        <span class="pl-p">}</span>
        <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span> <span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">n</span><span class="pl-p">][</span><span class="pl-n">m</span><span class="pl-p">]);</span>
        <span class="pl-n">output</span><span class="pl-p">(</span><span class="pl-n">n</span><span class="pl-p">,</span> <span class="pl-n">m</span><span class="pl-p">);</span>
    <span class="pl-p">}</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>